Time-dependent vehicle routing problem with backhaul with FIFO assumption: Variable neighborhood search and mat-heuristic variable neighborhood search algorithms
نویسندگان
چکیده
منابع مشابه
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
This paper presents a new hybrid variable neighborhood-tabu search heuristic for the Vehicle Routing Problem with Multiple Time windows. It also proposes a minimum backward time slack algorithm applicable to a multiple time windows environment. This algorithm records the minimum waiting time and the minimum delay during route generation and adjusts the arrival and departure times backward. The ...
متن کاملA Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a proble...
متن کاملA multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem
This paper addresses an integrated vehicle routing and driver scheduling problem arising at the largest fresh meat producer in Denmark. The problem consists of a one-week planning horizon, heterogeneous vehicles, and drivers with predefined work regulations. These regulations include, among other things, predefined workdays, fixed starting time, maximum weekly working duration, break rule. The ...
متن کاملA Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
The purpose of this paper is to present a new deterministic metaheuristic based on a modification of Variable Neighborhood Search of Mladenovic and Hansen (1997) for solving the vehicle routing problem with time windows. Results are reported for the standard 100, 200 and 400 customer data sets by Solomon (1987) and Gehring and Homberger (1999) and two real-life problems by Russell (1995). The f...
متن کاملA variable neighborhood search heuristic for periodic routing problems
The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem (PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon while there is some flexibility on the exact days of the visits. Hence, one has to choose the visit days f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2021
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2020.10.003